On Syndrome Decoding of Punctured Reed-Solomon and Gabidulin Codes
نویسندگان
چکیده
Punctured Reed-Solomon (RS) and Gabidulin (G) codes over the field Fqm with locators from the subfield Fq can be represented as interleaving of m correspondent codes over the subfield Fq or can be considered as virtual interleaving of m correspondent codes over the field Fqm . Using a probabilistic unique syndrome decoder, m-interleaved or virtually interleaved codes can be decoded up to the same radius m m+1(d − 1), where d is the code distance in Hamming metric for RS codes and in rank metric for G codes. We show that the correspondent decoders over the subfield Fq and the field Fqm are equivalent and conclude that in practice one should use a decoder over the subfield since it has less complexity.
منابع مشابه
Decoding of Block and Convolutional Codes in Rank Metric DISSERTATION
Rank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowadays...
متن کاملDecoding of block and convolutional codes in rank metric
R ank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowaday...
متن کاملReed-Muller Codes: Spherically-Punctured Codes and Decoding Algorithms
OF THE DISSERTATION Reed-Muller Codes: Spherically-Punctured Codes and Decoding Algorithms
متن کاملOn Transform–domain Decoding of Gabidulin Codes
Gabidulin codes are the rank metric analogues of Reed–Solomon codes and found many applications including network coding. Interleaving or the direct sum of Gabidulin codes allows both decreasing the redundancy and increasing the error correcting capability for network coding. In this paper, for Gabidulin codes we propose a transform–domain algorithm correcting both errors and erasures. We show ...
متن کاملGabidulin Codes that are Generalized Reed Solomon Codes
In this paper, we describe permutations that allow to move from a Gabidulin code to a GENERALIZED REED SOLOMON code. Mathematics Subject Classification: 11T71
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 57 شماره
صفحات -
تاریخ انتشار 2017